Extended Linear Multi-Commodity Multicost Network and Maximal Flow Limited Cost Problems
نویسندگان
چکیده
منابع مشابه
Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network
The shortest path finding algorithm is used in many problems on graphs and networks. This article will introduce the algorithm to find the shortest path between two vertices on the extended graph. Next, the algorithm finds the shortest path between the pairs of vertices on the extended graph with multiple weights is developed. Then, the shortest path finding algorithms is used to find the maxim...
متن کاملThe Relax Codes for Linear Minimum Cost Network Flow Problems*
We describe a relaxation algorithm [ 1,2] for solving the classical minimum cost net-work flow problem. Our implementation is compared with mature state-of-the-artprimal simplex and primal-dual codes and is found to be several times faster on alltypes of randomly generated network flow problems. Furthermore, the speed-upfactor increases with problem dimension. The codes, called ...
متن کاملDesigning Multi - Commodity Flow
The traditional multi-commodity ow problem assumes a given ow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity ow network-design problem: given a set of multi-commodity ow demands, nd a network subject to certain constraints such that the commodities can be maximally routed. This paper focuses on the case whe...
متن کاملMulti-commodity k-splittable survivable network design problems with relays
The network design problem is a well known optimization problem with applications in telecommunication, infrastructure designs and military operations. This paper devises the first formulation and solution methodology for the multi-commodity k-splittable two-edge disjoint survivable network design problem with capacitated edges and relays. This problem realistically portrays telecommunications ...
متن کاملA Parallel Algorithm for Nonlinear Multi-commodity Network Flow Problem
In this paper, we propose a method to solve the Nonlinear Multicommodity Network Flow (NMNF) Problem. We have combined this method with a projected-Jacobi (PJ) method and a duality based method possessing decomposition effects. With the decomposition, our method can be parallel processed and is computationally efficient. We have tested our method on several examples of NMNF problem and obtained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of Computer Networks & Communications
سال: 2018
ISSN: 0975-2293,0974-9322
DOI: 10.5121/ijcnc.2018.10106